Programming bsp and multi-bsp algorithms in ml

Bsp Programming 1. the Bsp Model

The Bulk Synchronous Parallel (BSP) model provides a uni-ed framework for the design and programming of general purpose parallel computing systems. In this paper we describe some programming language developments which are currently being pursued as part of this new, uniied approach to scalable parallel computing. A parallel random access machine (PRAM) 4] consists of a collection of processors...

BSP Constraint Programming

Programming with BSP Homomorphisms

Algorithmic skeletons in conjunction with list homomorphisms play an important role in formal development of parallel algorithms. We have designed a notion of homomorphism dedicated to bulk synchronous parallelism. In this paper we derive two application using this theory: sparse matrix vector multiplication and the all nearest smaller values problem. We implement a support for BSP homomorphism...

Sparse Computations and Multi-BSP

BSP is a simple but effective model for parallel computing. A BSP computer (p, g, l) consists of p sequential processors with sufficient local memory. A black-box network interconnects these. This network is assumed to be full duplex and optimised for all-to-all communication; a processor can thus simultaneously send and receive a single data word at constant cost g. The network has an associat...

BSPlib: The BSP programming library

BSPlib is a small communications library for bulk synchronous parallel (BSP) programming which consists of only 20 basic operations. This paper presents the full deenition of BSPlib in C, motivates the design of its basic operations, and gives examples of their use. The library enables programming in two distinct styles: direct remote memory access using put or get operations, and bulk synchron...